ans=0
x=0
for i in range(int(input())):
a,b=map(int,input().split())
x=x-a
ans=max(ans,x)
x=x+b
ans=max(ans,x)
print(ans)#include<bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <utility>
#include <set>
using namespace std;
int main()
{long long b ;
cin >> b ;
long long n[b] ,m[b] , s = 0, d[b] , v=0;
for(int i = 0 ; i < b ; i++)
{
cin >> n[i] >> m[i];
s+= m[i];
s+= - n[i];
d[i]= s;
if(v < d[i])
{
v = d[i];
}
}
cout << v << endl;
return 0;}
MSNSADM1 Football | MATCHES Playing with Matches |
HRDSEQ Hard Sequence | DRCHEF Doctor Chef |
559. Maximum Depth of N-ary Tree | 821. Shortest Distance to a Character |
1441. Build an Array With Stack Operations | 1356. Sort Integers by The Number of 1 Bits |
922. Sort Array By Parity II | 344. Reverse String |
1047. Remove All Adjacent Duplicates In String | 977. Squares of a Sorted Array |
852. Peak Index in a Mountain Array | 461. Hamming Distance |
1748. Sum of Unique Elements | 897. Increasing Order Search Tree |
905. Sort Array By Parity | 1351. Count Negative Numbers in a Sorted Matrix |
617. Merge Two Binary Trees | 1450. Number of Students Doing Homework at a Given Time |
700. Search in a Binary Search Tree | 590. N-ary Tree Postorder Traversal |
589. N-ary Tree Preorder Traversal | 1299. Replace Elements with Greatest Element on Right Side |
1768. Merge Strings Alternately | 561. Array Partition I |
1374. Generate a String With Characters That Have Odd Counts | 1822. Sign of the Product of an Array |
1464. Maximum Product of Two Elements in an Array | 1323. Maximum 69 Number |